A New Truck-Drone Routing Problem for Parcel Delivery Services Aided by Parking Lots

Collaborative routing aided by drones in last-mile delivery (LMD) has been an extensively studied topic recent years. In this article, a new optimization problem for collaborative with truck and fleet of LMD is introduced. The proposes strategy to coordinate serve given set customers. plan based on identifying the locations where can park fly A procedure locate these parking lots conveniently given. For transportation network, which includes points, mixed linear integer programming formulation provided, aims minimize makespan serving all Computational experiments instances were conducted analyze model solutions' characteristics find their computational limits. showed that proposed could significantly improve results obtained when only delivers. Additionally, we propose GRASP metaheuristic solve greater size. Its performance was applied different characteristics. paper discusses some insights from experimentation presents future research directions.